The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate
نویسنده
چکیده
It is widely known that the Ford-Fulkerson procedure for nding the maximumow in a network need not terminate if some of the capacities of the network are irrational. Ford and Fulkerson gave as an example a network with 10 vertices and 48 edges on which their procedure may fail to halt. We construct much smaller and simpler networks on which the same may happen. Our smallest network has only 6 vertices and 8 edges. We show that it is the smallest example possible.
منابع مشابه
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing “flow” along “augmenting paths”: the Ford-Fulkerson algorithm for the maximum flow problem and the Gale-Shapley algorithm for the stable allocation problem (a many-to-many generalization of the stable matching problem). Both algorithms clearly terminate when given integral input data. For real-valued input data...
متن کاملTransfinite Ford-Fulkerson on a Finite Network
It is well-known that the Ford-Fulkerson algorithm for finding a maximum flow in a network need not terminate if we allow the arc capacities to take irrational values. Every non-terminating example converges to a limit flow, but this limit flow need not be a maximum flow. Hence, one may pass to the limit and begin the algorithm again. In this way, we may view the Ford-Fulkerson algorithm as a t...
متن کاملMount CMSC 451 : Lecture 16 Network Flow Algorithms
Algorithmic Aspects of Network Flow: In the previous lecture, we presented the Ford-Fulkerson algorithm. We showed that on termination this algorithm produces the maximum flow in an s-t network. In this lecture we discuss the algorithm’s running time, and discuss more efficient alternatives. Analysis of Ford-Fulkerson: Before discussing the worst-case running time of the Ford-Fulkerson algorith...
متن کاملImplicit Maximization of Flows over Time
Flows over time may be maximized by computing a static maximum flow on the corresponding time-expanded network, which contains a copy of the original network for each discrete time step. This makes available the whole algorithmic toolbox developed for static flows. The major drawback of this method compared to a polynomial (motivated by Ford and Fulkerson [6, 7]) is that the time-expanded netwo...
متن کاملA Parallel Ford-Fulkerson Algorithm For Maximum Flow Problem
The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively. The Ford-Fulkerson algorithm is a simple algorithm to solve the maximum flow problem based on the idea of augmenting path. But its time complexity is high and it’s a pseudo-polynomial time algorithm. In this paper, a parallel Ford-Fulkerson algorithm is given. The idea ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 148 شماره
صفحات -
تاریخ انتشار 1995